Utils.h

Go to the documentation of this file.

/*
 * Utils.h
 *
 *  Created on: Jul 10, 2009
 *      Author: dberrios
 */

#ifndef UTILS_H_
#define UTILS_H_

namespace ccmc
{
    template<class T>
    class Utils
    {
        public:
            Utils();
            static int binary_search(const std::vector<T>& vec, unsigned int start, unsigned int end, const T& key);
            virtual ~Utils();
    };

    template<class T>
    int Utils<T>::binary_search(const std::vector<T>& vec, unsigned int start, unsigned int end, const T& key)
    {
        // Termination condition: start index greater than end index

        if (start > end)
        {
            return -1;
        }

        // Find the middle element of the vector and use that for splitting
        // the array into two pieces.
        unsigned int middle = (start + ((end - start) / 2));

        //outside valid range
        if (middle > vec.size())
            return -1;

        if (key == vec[middle])
        {
            return middle;
        } else if (key < vec[middle + 1] && key >= vec[middle])
        {
            return middle;
        } else if (key < vec[middle])
        {
            return binary_search(vec, start, middle - 1, key);
        }
        return binary_search(vec, middle + 1, end, key);
    }
}
#endif /* UTILS_H_ */